Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
نویسندگان
چکیده
منابع مشابه
Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, there are only a few theoretical results on this subject. We consider the approximation ability of randomized search for the class of covering problems and compare single-objective and multi-objective models for such pro...
متن کاملApproximating Multi-Objective Hyper-Heuristics for Solving 2D Irregular Cutting Stock Problems
This article presents a method based on the multi-objective evolutionary algorithm NSGA-II to approximate hyper-heuristics for solving irregular 2D cutting stock problems under multiple objectives. In this case, additionally to the traditional objective of minimizing the number of sheets used to fit a finite number of irregular pieces, the time required to perform the placement task is also min...
متن کاملProbabilistic Power Distribution Planning Using Multi-Objective Harmony Search Algorithm
In this paper, power distribution planning (PDP) considering distributed generators (DGs) is investigated as a dynamic multi-objective optimization problem. Moreover, Monte Carlo simulation (MCS) is applied to handle the uncertainty in electricity price and load demand. In the proposed model, investment and operation costs, losses and purchased power from the main grid are incorporated in the f...
متن کاملBuilding General Hyper-Heuristics for Multi-Objective Cutting Stock Problems
In this article we build multi-objective hyperheuristics (MOHHs) using the multi-objective evolutionary algorithm NSGA-II for solving irregular 2D cutting stock problems under a bi-objective minimization schema, having a trade-off between the number of sheets used to fit a finite number of pieces and the time required to perform the placement of these pieces. We solve this problem using a multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2010
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco_a_00003